How to Cluster Evolving Graphs
نویسندگان
چکیده
Clustering is a frequently used tool in the analysis and evaluation of large and complex networks. Most such networks result from or model dynamic processes, thus clustering techniques need to be adapted. We provide a model for clustering graphs that are subject to changes. More precisely, we address the update problem, i. e., maintaining the clustering while nodes and edges can be inserted and deleted, as well as the issue of clustering graph sequences. Furthermore, we give some illustrating examples and point out several pitfalls. This work is a first step towards a sound foundation for clustering on evolving graphs.
منابع مشابه
Clustering-based Scalable Evolving Graphs for Vehicular Ad Hoc Networks
Message routing in vehicular ad hoc networks (VANETs) pose a particular technical challenge due to their highly dynamic nature. Eiza and Ni [1] have proposed an evolving graph approach to route messages in VANETs both reliably and efficiently. Evolving graphs, however, are resource intensive and do not scale well as the density of vehicles in the network increases. In this paper, we present a h...
متن کاملPaCK: Scalable Parameter-Free Clustering on K-Partite Graphs
Given an author-paper-conference graph, how can we automatically find groups for author, paper and conference respectively. Existing work either (1) requires fine tuning of several parameters, or (2) can only be applied to bipartite graphs (e.g., author-paper graph, or paper-conference graph). To address this problem, in this paper, we propose PaCK for clustering such k-partite graphs. By optim...
متن کاملCLUDE: An Efficient Algorithm for LU Decomposition Over a Sequence of Evolving Graphs
In many applications, entities and their relationships are represented by graphs. Examples include the WWW (web pages and hyperlinks) and bibliographic networks (authors and co-authorship). A graph can be conveniently modeled by a matrix from which various quantitative measures are derived. Some example measures include PageRank and SALSA (which measure nodes’ importance), and Personalized Page...
متن کاملDynamic Network Evolution: Models, Clustering, Anomaly Detection
Traditionally, research on graph theory focused on studying graphs that are static. However, almost all real networks are dynamic in nature and large in size. Quite recently, research areas for studying the topology, evolution, applications of complex evolving networks and processes occurring in them and governing them attracted attention from researchers. In this work, we review the significan...
متن کاملMulti-Step Community Detection and Hierarchical Time Segmentation in Evolving Networks
Many complex systems composed of interacting objects like social networks or the web can be modeled as graphs. They can usually be divided in dense sub-graphs with few links between them, called communities and detecting this underlying community structure may have a major impact in the understanding of these systems. We focus here on evolving graphs, for which the usual approach is to represen...
متن کامل